#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
const LL mod=100019;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL fac[100];
LL ksm(LL a,LL k){
    LL res=1;
    while(k>0){
        if(k&1) res=res*a%mod;
        k>>=1;
        a=a*a%mod;
    }
    return res%mod;
}
//LL dfs(LL pos,LL lastnum){
//   if(pos==0){
//      return 1;
//   }
//   LL ans=0;
//   for(LL i=lastnum;i>=1;i--){
//
//      ans+=dfs(pos-1,i);
//   }
//   return ans;
//}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);

   fac[0]=1;
   for(LL i=1;i<=10;i++) fac[i]=fac[i-1]*i%mod;
  //// LL n;cin>>n;
//   for(LL i=1;i<=20;i++){
//        LL ans=dfs(i,9);
//        cout<<"ans="<<ans<<"\n";
//   }
    LL n;cin>>n;
    n+=8;
    LL ans=1;
    for(LL i=n;i>=n-8+1;i--){
        ans=(ans%mod*i%mod)%mod;
    }
    for(LL i=2;i<=8;i++){
        ans=(ans%mod*ksm(i,mod-2)%mod)%mod;
    }
   /// ans=(ans%mod*ksm(fac[8],mod-2)%mod)%mod;
    cout<<ans<<"\n";
   return 0;
}
